Modelling Real-time Multi-tasking Systems with Timed Traces Note: Most Svrc Technical Reports Are Available Modelling Real-time Multi-tasking Systems with Timed Traces
نویسنده
چکیده
We formalise the behaviour of non-preemptive, real-time, multi-tasking systems by expressing the computational components assumed by real-time scheduling theory in a trace-based notation. The model is suitable as a target implementation domain for dataaow reenements, amenable to formal schedulability analysis, and implementable in a concurrent real-time programming language.
منابع مشابه
Towards Real - Time Object - ZGraeme
Most SVRC technical reports are available via anonymous ftp, from svrc.it.uq.edu.au in the directory /pub/techreports. Abstracts and compressed postscript les are available from Abstract This paper presents a method of formally specifying systems involving continuous variables and real-time constraints using the object-oriented state-based speciication language Object-Z together with the timed ...
متن کاملNote: Most Svrc Technical Reports Are Available via State-machine versus Trace Modelling of Real-time Reactive Systems
State-machine versus trace modelling of real-time reactive systems C. Abstract. Both extended state-machines and trace-based models have been promoted as appropriate speciication methods for real-time systems. We present the same real-time speciication in both styles, in order to clearly compare the two approaches.
متن کاملSpeciication and Reenement of a Real-time Control System Note: Most Svrc Technical Reports Are Available via Speciication and Reenement of a Real-time Control System
A number of timed-trace formalisms, where systems are modelled by time-varying functions, have been proposed for the formal development of real-time systems. In this paper, we illustrate one such approach via the speciication and reenement of the well-known Steam Boiler Control Problem. The case study illustrates the use of a timed-trace formalism to specify deadlines and other timing constrain...
متن کاملExact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking
To determine schedulability of priority-driven periodic tasksets on multi-processor systems, it is necessary to rely on utilization bound tests that are safe but pessimistic, since there is no known method for exact schedulability analysis for multi-processor systems analogous to the response time analysis algorithm for single-processor systems. In this paper, we use model-checking to provide a...
متن کاملThe Algebra of Multi-tasking
Modelling multi-tasking behaviour is an important phase of real-time system design. It is shown how task scheduling principles can be captured in a CCS-based process algebra via extensions for both asymmetric interleaving, to model intraprocessor scheduling decisions, and for asynchronous communication, to model interprocessor precedence constraints. Examples are given of task preemption, block...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998